Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions
نویسندگان
چکیده
منابع مشابه
Multicut Algorithms via Tree Decompositions
Various forms of multicut problems are of great importance in the area of network design. In general, these problems are intractable. However, several parameters have been identified which lead to fixedparameter tractability (FPT). Recently, Gottlob and Lee have proposed the treewidth of the structure representing the graph and the set of pairs of terminal vertices as one such parameter. In thi...
متن کاملOnline Network Design Algorithms via Hierarchical Decompositions
We develop a new approach for online network design and obtain improved competitive ratios for several problems. Our approach gives natural deterministic algorithms and simple analyses. At the heart of our work is a novel application of embeddings into hierarchically well-separated trees (HSTs) to the analysis of online network design algorithms — we charge the cost of the algorithm to the cost...
متن کاملExplicit Linear Kernels via Dynamic Programming
Several algorithmic meta-theorems on kernelization have appeared in the last years, starting with the result of Bodlaender et al. [FOCS 2009] on graphs of bounded genus, then generalized by Fomin et al. [SODA 2010] to graphs excluding a fixed minor, and by Kim et al. [ICALP 2013] to graphs excluding a fixed topological minor. Typically, these results guarantee the existence of linear or polynom...
متن کاملEfficient anisotropic α-Kernels decompositions and flows
The Laplacian raised to fractional powers can be used to generate scale spaces as was shown in recent literature. This was later extended for inhomogeneous diffusion processes and more general functions of the Laplacian and studied for the Perona-Malik case. In this paper we extend the results to the truly anisotropic Beltrami flow. We additionally introduce a technique for splitting up the wor...
متن کاملMinimizing a General Penalty Function on a Single Machine via Developing Approximation Algorithms and FPTASs
This paper addresses the Tardy/Lost penalty minimization on a single machine. According to this penalty criterion, if the tardiness of a job exceeds a predefined value, the job will be lost and penalized by a fixed value. Besides its application in real world problems, Tardy/Lost measure is a general form for popular objective functions like weighted tardiness, late work and tardiness with reje...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2016
ISSN: 1549-6325,1549-6333
DOI: 10.1145/2797140